Minimal fully adaptive fuzzy-based routing algorithm for Networks-on-Chip
نویسندگان
چکیده
منابع مشابه
A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملEarly Transition for Fully Adaptive Routing Algorithms in On-Chip Interconnection Networks
Interconnection networks have become prevalent not only in massively parallel processing systems, but also in chip multiprocessors. Unlike off-chip interconnection networks, limited available resources in on-chip interconnection networks mandate to choose simple routing algorithms which, in turn, provide low throughput. Fully adaptive routing algorithms improve throughput, but need escape chann...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملOptimal Fully Adaptive Minimal Wormhole Routing for Meshes1
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...
متن کاملOptimal Fully Adaptive Minimal Wormhole Routing for Meshes
A deadlock-free fully adaptive minimal routing algorithm for meshes that is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. It is also proved that, ignoring symmetry, this routing algorithm is the only fully adaptive routing algorithm with uniform routers that achieves both of these goals. This new al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2011
ISSN: 1349-2543
DOI: 10.1587/elex.8.1102